Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Lambda")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 7355

  • Page / 295
Export

Selection :

  • and

Definability of total objects in PCF and related calculiNORMANN, Dag.Lecture notes in computer science. 2001, pp 4-5, issn 0302-9743, isbn 3-540-41960-8Conference Paper

TLCA 2001 : typed lambda calculi and applications (Krakow, 2-5 May 2001)Abramsky, Samson.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-41960-8, XI, 429 p, isbn 3-540-41960-8Conference Proceedings

On the lambda Y calculusSTATMAN, Rick.Proceedings - Symposium on Logic in Computer Science. 2002, pp 159-166, issn 1043-6871, isbn 0-7695-1483-9, 8 p.Conference Paper

Representations of first order function types as terminal coalgebrasALTENKIRCH, Thorsten.Lecture notes in computer science. 2001, pp 8-21, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Quelques résultats sur le λ C-calcul = Some results about λ C-calculKARIM NOUR.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 320, Num 3, pp 259-262, issn 0764-4442Article

Sur le problème de la typabilité dans le système F = About the problem of typability in the system FMALECKI, S.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 316, Num 11, pp 1111-1116, issn 0764-4442Article

A deconstruction of non-deterministic classical cut eliminationLAIRD, J.Lecture notes in computer science. 2001, pp 268-282, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Efficient λ-evaluation with interaction netsMACKIE, Ian.Lecture notes in computer science. 2004, pp 155-169, issn 0302-9743, isbn 3-540-22153-0, 15 p.Conference Paper

Strong normalization from weak normalization in typed λ-calculiSØRENSEN, M. H.Information and computation (Print). 1997, Vol 133, Num 1, pp 35-71, issn 0890-5401Article

Life without the terminal typeSCHRÖDER, Lutz.Lecture notes in computer science. 2001, pp 429-442, issn 0302-9743, isbn 3-540-42554-3Conference Paper

The small grzegorczyk classes and the typed λ-calculusKRISTIANSEN, Lars; BARRA, Mathias.Lecture notes in computer science. 2005, pp 252-262, issn 0302-9743, isbn 3-540-26179-6, 11 p.Conference Paper

Reductions, intersection types, and explicit substitutionsDOUGHERTY, Dan; LESCANNE, Pierre.Lecture notes in computer science. 2001, pp 121-135, issn 0302-9743, isbn 3-540-41960-8Conference Paper

On the Jacopini techniqueKUPER, J.Information and computation (Print). 1997, Vol 138, Num 2, pp 101-123, issn 0890-5401Article

Extensions of F≤ with decidable typingVorobyov, Sergei.1994, 29 p.Report

TLCA 2005 : typed lambda calculi and applications (Nara, 21-23 April 2005)Urzyczyn, Pawel.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25593-1, XI, 432 p, isbn 3-540-25593-1Conference Proceedings

Retracts in simple typesPADOVANI, Vincent.Lecture notes in computer science. 2001, pp 376-384, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Categorical semantics of controlSELINGER, Peter.Lecture notes in computer science. 2001, pp 6-7, issn 0302-9743, isbn 3-540-41960-8Conference Paper

The Barendregt Cube with definitions and generalised reductionBLOO, R; KAMAREDDINE, F; NEDERPELT, R et al.Information and computation (Print). 1996, Vol 126, Num 2, pp 123-143, issn 0890-5401Article

Caractérisation opérationnelle des entiers classiques en λ C-calcul = Operational characterization of classical integer in λ C-calculusNOUR, K.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 320, Num 12, pp 1431-1434, issn 0764-4442Article

Polymorphic typing with subtyping proof normalization and least type for the F≤ cloneVorobyov, Sergei.1994, 14 p.Report

Needed reduction and spine strategies for the lambda calculusBARENDREGT, H. P; KENNAWAY, J. R; KLOP, J. W et al.Information and computation (Print). 1987, Vol 75, Num 3, pp 191-231, issn 0890-5401Article

TLCA 2003 : typed lambda calculi and applications (Valencia, 10-12 June 2003)Hofmann, Martin.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40332-9, VIII, 315 p, isbn 3-540-40332-9Conference Proceedings

The Girard-Reynolds isomorphismWADLER, Philip.Lecture notes in computer science. 2001, pp 468-491, issn 0302-9743, isbn 3-540-42736-8Conference Paper

A token machine for full geometry of interactionLAURENT, Olivier.Lecture notes in computer science. 2001, pp 283-297, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Characterizing convergent terms in object calculi via intersection typesDE 'LIGUORO, Ugo.Lecture notes in computer science. 2001, pp 315-328, issn 0302-9743, isbn 3-540-41960-8Conference Paper

  • Page / 295